Inverted finite elements: a new method for solving elliptic problems in unbounded domains
نویسندگان
چکیده
منابع مشابه
Inverted Finite Elements: a New Method for Solving Elliptic Problems in Unbounded Domains
In this paper, we propose a new numerical method for solving elliptic equations in unbounded regions of R. The method is based on the mapping of a part of the domain into a bounded region. An appropriate family of weighted spaces is used for describing the growth or the decay of functions at large distances. After exposing the main ideas of the method, we analyse carefully its convergence. Some...
متن کاملSOLVING SINGULAR ODES IN UNBOUNDED DOMAINS WITH SINC-COLLOCATION METHOD
Spectral approximations for ODEs in unbounded domains have only received limited attention. In many applicable problems, singular initial value problems arise. In solving these problems, most of numerical methods have difficulties and often could not pass the singular point successfully. In this paper, we apply the sinc-collocation method for solving singular initial value problems. The ability...
متن کاملElliptic and parabolic problems in unbounded domains
We consider elliptic and parabolic problems in unbounded domains. We give general existence and regularity results in Besov spaces and semi-explicit representation formulas via operatorvalued fundamental solutions which turn out to be a powerful tool to derive a series of qualitative results about the solutions. We give a sample of possible applications including asymptotic behavior in the larg...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Mathematical Modelling and Numerical Analysis
سال: 2005
ISSN: 0764-583X,1290-3841
DOI: 10.1051/m2an:2005001